Linear programming relaxation - PDFSEARCH.IO - Document Search Engine

Linear programming relaxation
Results: 230

#	Item
41	http://4c.ucc.ie/~rmarines/talks/tutorial-IJCAI-09-syllabus.pdf Combinatorial Optimization for Graphical Models Rina Dechter Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2009-08-12 01:12:13 Applied mathematics Operations research Mathematics Constraint optimization Optimization problem Relaxation Combinatorial optimization Local consistency Linear programming Mathematical optimization Constraint programming Theoretical computer science
42	Noncommercial Software for Mixed-Integer Linear Programming J. T. Linderoth∗ T. K. Ralphs† December, 2004. Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2010-06-19 14:25:53 Combinatorial optimization Relaxation Linear programming Linear programming relaxation Inequality Branch and cut MINTO Algorithm Cutting-plane method Mathematical optimization Mathematics Operations research
43	Duality for Mixed-Integer Linear Programs M. Guzelsoy∗ T. K. Ralphs† Original May, 2006 Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2010-06-19 14:25:53 Linear programming Convex optimization Operations research Combinatorial optimization Cutting-plane method Duality Derivative Relaxation Vector space Mathematics Mathematical optimization Mathematical analysis
44	Robust Solutions for Constraint Satisfaction and Optimization Emmanuel Hebrard and Brahim Hnich and Toby Walsh 12 Abstract. Super solutions are a mechanism to provide robustness to constraint programsThey are solu Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2010-11-22 06:22:32 Computing Constraint satisfaction problem Constraint satisfaction Local consistency Backtracking Optimization problem Mathematical optimization Min-conflicts algorithm Linear programming relaxation Constraint programming Software engineering Computer programming
45	On the Capacitated Vehicle Routing Problem∗ T.K. Ralphs†, L. Kopman‡, W.R. Pulleyblank§, and L.E. Trotter, Jr.¶ Revised December 17, 2001 Abstract We consider the Vehicle Routing Problem, in which a fixed fleet o Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2010-06-19 14:25:53 Applied mathematics Convex optimization Relaxation Linear programming Travelling salesman problem Lagrangian relaxation Simplex algorithm Mathematical optimization Operations research Mathematics
46	Disjoint, Partition and Intersection Constraints for Set and Multiset Variables Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2010-11-22 06:22:29 Software engineering Local consistency Multiset Boolean satisfiability problem Cardinality Decomposition method Linear programming relaxation Constraint programming Theoretical computer science Mathematics
47	Journal of Artificial Intelligence Research362 Submitted 4/12; publishedA Tutorial on Dual Decomposition and Lagrangian Relaxation for Inference in Natural Language Processing Add to Reading List Source URL: jair.org Language: English - Date: 2012-10-30 19:41:28 Operations research Linear programming Relaxation Duality Lagrange multiplier Lagrangian Viterbi algorithm Decomposition method Optimization problem Mathematical optimization Mathematical analysis Convex optimization
48	Parallel Branch and Cut T.K. Ralphs∗ Revised January 17, 2006 Abstract We discuss the main issues that arise in parallelizing the well-known branch-andcut algorithm for solving mixed-integer linear programs. Designing Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2010-06-19 14:25:51 Combinatorial optimization Applied mathematics Linear programming Linear programming relaxation Algorithm Divide and conquer algorithm Heuristic function Branch and cut Branch and bound Mathematical optimization Mathematics Operations research
49	Semidefinite relaxations for optimization problems over rotation matrices James Saunderson Pablo A. Parrilo Add to Reading List Source URL: www.mit.edu Language: English - Date: 2014-10-10 11:55:55 Convex analysis Operations research Real algebraic geometry Linear programming Semidefinite programming Relaxation Convex hull Convex optimization Linear matrix inequality Mathematical optimization Mathematical analysis Mathematics
50	Solving online feasibility problem in constant amortized time per update Lilian Buzer∗† global shape of the pixels by minimizing an approximation error. But, using digital primitives we can build an exact approximati Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:46 Applied mathematics Convex optimization Linear programming Constraint Candidate solution Algorithm Linear programming relaxation LP-type problem Mathematical optimization Operations research Mathematics